Search results for "Computational Science and Engineering"
showing 4 items of 4 documents
Bounds on transient phase plastic deformations in optimal design of steel frames subjected to cyclic loads
2009
A minimum volume multicriterion design of elastic perfectly plastic steel frames subjected to a combination of quasi-static fixed and cyclic loads, bounding the transient phase plastic deformations, is proposed. The problem is formulated according to a plastic shakedown criterion, so that incremental and instantaneous collapse are certainly prevented when the frame is subjected to very strongly amplified cyclic loads. The further condition that the structure must also behave elastically in serviceability conditions is imposed. Since the steady-state loading history is known it is possible to directly bound the steady-state plastic deformations. By applying a suitable own bounding theorem, i…
Computational engineering to enhance the photovoltaic by end‐capped and bridging core alterations: Empowering the future with solar energy through sy…
2021
Frames and weak frames for unbounded operators
2020
In 2012 G\u{a}vru\c{t}a introduced the notions of $K$-frame and of atomic system for a linear bounded operator $K$ in a Hilbert space $\mathcal{H}$, in order to decompose its range $\mathcal{R}(K)$ with a frame-like expansion. In this article we revisit these concepts for an unbounded and densely defined operator $A:\mathcal{D}(A)\to\mathcal{H}$ in two different ways. In one case we consider a non-Bessel sequence where the coefficient sequence depends continuously on $f\in\mathcal{D}(A)$ with respect to the norm of $\mathcal{H}$. In the other case we consider a Bessel sequence and the coefficient sequence depends continuously on $f\in\mathcal{D}(A)$ with respect to the graph norm of $A$.
Elastic plastic analysis iterative solution
1998
The step-by-step analysis of finite element elastic plastic structures subjected to an assigned (quasi-static) loading history, is considered; it identifies with the well-known sequence of linear complementarity problems. An iterative technique devoted to solve the relevant linear complementarity problem is presented. It is based on the recursive solution of a suitable linear complementarity problem, deduced from the relevant one and easier than it. The procedure convergency is proved. Some noticing particular cases are examined. The physical meaning of the procedure is shown to be a plastic relaxation. The suitable numerical ranges for some check parameter values, to be utilized in the app…